A refined coherent point drift (CPD) algorithm for point set registration

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-rigid point set registration: Coherent Point Drift

We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation problem with motion coherence constraint over the velocity field such that one point set moves coherently to align with the second set. We formulate the motion coherence constraint and derive a solution of regularized ...

متن کامل

Affine iterative closest point algorithm for point set registration

Article history: Received 24 April 2009 Received in revised form 15 January 2010 Available online 25 January 2010 Communicated by Y. Liu

متن کامل

3D non-rigid registration using color: Color Coherent Point Drift

Research into object deformations using computer vision techniques has been under intense study in recent years. A widely used technique is 3D non-rigid registration to estimate the transformation between two instances of a deforming structure. Despite many previous developments on this topic, it remains a challenging problem. In this paper we propose a novel approach to non-rigid registration ...

متن کامل

Generalised Coherent Point Drift for Group-Wise Registration of Multi-dimensional Point Sets

In this paper we propose a probabilistic approach to groupwise registration of unstructured high-dimensional point sets. We focus on registration of generalised point sets which encapsulate both the positions of points on surface boundaries and corresponding normal vectors describing local surface geometry. Richer descriptions of shape can be especially valuable in applications involving comple...

متن کامل

A New Point-set Registration Algorithm for Fingerprint Matching

A novel minutia-based fingerprint matching algorithm is proposed that employs iterative global alignment on two minutia sets. The matcher considers all possible minutia pairings and iteratively aligns the two sets until the number of minutia pairs does not exceed the maximum number of allowable oneto-one pairings. The optimal alignment parameters are derived analytically via linear least square...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2011

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-011-4465-7